Language preorder as a precongruence
نویسنده
چکیده
Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulation equivalence. This article proposes additional syntactic requirements on the tyft format, extended with predicates, to obtain a precongruence format for language preorder.
منابع مشابه
A precongruence format for should testing preorder
Should testing preorder was proposed as a liveness-preserving precongruence for a process algebra except for nondeterministic choice operator [22]. However, this precongruce result cannot be generalized to other languages before carefully proved. In this paper, we show that τDes format is a precongruence format for should testing preorder. A precongruence format guarantees the precongruence of ...
متن کاملThe must preorder revisited – an algebraic theory for web services contracts –
We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must preorder, and it exhibits good precongruenc...
متن کاملHow to Prove Similarity a Precongruence in Non-Deterministic Call-by-Need Lambda Calculi
Extending the method of Howe, we establish a large class of untyped higher-order calculi, in particular such with call-by-need evaluation, where similarity, also called applicative simulation, can be used as a proof tool for showing contextual preorder. The paper also demonstrates that Mann’s approach using an intermediate “approximation” calculus scales up well from a basic call-by-need non-de...
متن کاملDeciding the Precongruence for Deadlock Freedom Using Operating Guidelines
In the context of asynchronously communicating and deadlock free services, the refinement relation of services has been formalized by the accordance preorder. A service Impl accords with a service Spec if every controller of Spec—that is, every environment that can interact with service Spec without deadlocking—is a controller of Impl . The procedure to decide accordance of two services uses th...
متن کاملPrecongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin’s structural approach. For several preorders in the linear time – branching time spectrum a format is given, as general as possible, such that this preorder is a precon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 243 شماره
صفحات -
تاریخ انتشار 2000